A continuous network design model in stochastic user equilibrium based on sensitivity analysis

نویسندگان

  • Yongtaek Lim
  • Benjamin G Heydecker
  • Seungjae Lee
چکیده

The continuous network design problem (CNDP) is known to be difficult to solve due to the property of non-convexity and nonlinearity. Such kind of CNDP can be formulated as a bi-level programme, which may be classified into Stackelberg approach and Nash one according to the relationship between the upper level and the lower level parts. This paper formulates the CNDP for road expansion based on Stackelberg game where leader and follower exist, and allows for errors of travelers' behavior in choosing their routes. In order to solve the problem by Stackelberg approach, we need a relation between link flow and design parameter. For the purpose of that, we use logit route choice model, in which there exists an explicit closed-form function between them. The developed model will be applied to two example road networks for test and compared the results between the Stackelberg and Nash approaches to emphasise their differenc between them.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Continuous Network Design Based on the Paired Combinatorial Logit Sto- chastic User Equilibrium Model

In order to design the traffic network more accurately, the bi-level programming model for the continuous network design problem based on the paired combinatorial Logit stochastic user equilibrium model is proposed in this study. In the model, the paired combinatorial Logit stochastic user equilibrium model which is used to characterize the route choice behaviors of the users is adopted in the ...

متن کامل

A Benders\' Decomposition Based Solution Method for Solving User Equilibrium Problem: Deterministic and Stochastic Cases

The traffic assignment problem is one of the most important problems for analyzing and optimizing the transportation network to find optimal flows. This study presented a new formulation based on a generalized Benders' decomposition approach to solve its important part, i.e. user equilibrium problems, in deterministic and stochastic cases. The new approach decomposed the problem into a master p...

متن کامل

Sensitivity analysis of the variable demand probit stochastic user equilibrium with multiple user-classes

This paper presents a formulation of the multiple user class, variable demand, probit stochastic user equilibrium model (SUE). Sufficient conditions are stated for differentiability of the equilibrium flows of this model. This justifies the derivation of sensitivity expressions for the equilibrium flows. This paper then considers the network design problem (NDP), assuming that users’ responses ...

متن کامل

A novel bi-level stochastic programming model for supply chain network design with assembly line balancing under demand uncertainty

This paper investigates the integration of strategic and tactical decisions in the supply chain network design (SCND) considering assembly line balancing (ALB) under demand uncertainty. Due to the decentralized decisions, a novel bi-level stochastic programming (BLSP) model has been developed in which SCND problem has been considered in the upper-level model, while the lower-level model contain...

متن کامل

Feasible and Descent Direction Method for Continuous Equilibrium Network Design Problem

In this study, we firstly express the stochastic user equilibrium traffic assignment problem in asymmetric traffic network as variation inequality model and then formulate ntinuous network design problem as mathematical program with equilibrium constraints. When path flow travel cost function is continuous, differentiable and strong monotone, the solution of variational inequality follows logit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005